SIAM Journal on Computing -- 1976

By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

© SIAM

SIAM Journal on Computing

ATTENTION: System maintenance will be performed the weekend of Saturday, March 28, 2009. This event will begin at 6:00 am on March 28 and will conclude at approximately 12:00 noon on Sunday March 29 (all times EDT). Some Scitation services may be affected during this period.

Table of Contents

Available Volumes| Issue Index| View myArticles

Search This Issue

Volume 5, Issue 4, pp. 589-758

Please Note: Electronic articles are available well in advance of the printed articles.

Theory of Output Set Assignments and Degree Switching Operations

Bharat Kinariwala and Kabekode V. S. Bhat

pp. 589-601

BibTeX Abstract Full Text: PDF

Ranking Algorithms for Lists of Partitions

S. G. Williamson

pp. 602-617

BibTeX Abstract Full Text: PDF

Fast Parallel Matrix Inversion Algorithms

pp. 618-623

BibTeX Abstract Full Text: PDF

On the Number of Multiplications Required for Matrix Multiplication

Roger W. Brockett and David Dobkin

pp. 624-628

BibTeX Abstract Full Text: PDF

General Results on Tour Lengths in Machines and Digraphs

Takao Asano, Michiro Shibui, and Itsuo Takanami

pp. 629-645

BibTeX Abstract Full Text: PDF

On Sets Cook-Reducible to Sparse Sets

Robert M. Solovay

pp. 646-652

BibTeX Abstract Full Text: PDF

Augmentation Problems

Kapali P. Eswaran and R. Endre Tarjan

pp. 653-665

BibTeX Abstract Full Text: PDF

Simple Programs Realize Exactly Presburger Formulas

John C. Cherniavsky

pp. 666-677

BibTeX Abstract Full Text: PDF

On the Parallel Evaluation of Boolean Expressions

Amnon Barak and Eliahu Shamir

pp. 678-681

BibTeX Abstract Full Text: PDF

A Generalized Asymptotic Upper Bound on Fast Polynomial Evaluation and Interpolation

Francis Y. Chin

pp. 682-690

BibTeX Abstract Full Text: PDF

On the Complexity of Timetable and Multicommodity Flow Problems

S. Even, A. Itai, and A. Shamir

pp. 691-703

BibTeX Abstract Full Text: PDF

The Planar Hamiltonian Circuit Problem is NP-Complete

M. R. Garey, D. S. Johnson, and R. Endre Tarjan

pp. 704-714

BibTeX Abstract Full Text: PDF

An Account of Self-Organizing Systems

W. J. Hendricks

pp. 715-723

BibTeX Abstract Full Text: PDF

Finding Minimum Spanning Trees

David Cheriton and Robert Endre Tarjan

pp. 724-742

BibTeX Abstract Full Text: PDF

Analysis of the Optimal, Look-Ahead Demand Paging Algorithms

pp. 743-757

BibTeX Abstract Full Text: PDF

Errata: On Optimal Processor Scheduling for Multiprogramming

p. 758

BibTeX Abstract Full Text: PDF